New infinite families of Candelabra Systems with block size 6 and stem size 2
نویسنده
چکیده
In this paper, we seek to generalize a construction of Hanani which produces a Steiner 3design on a larger set of points starting from a smaller Steiner 3-design, with constant block size 6. We achieve this by constructing new infinite families of uniform Candelabra Systems with block size 6 and stem size 2.
منابع مشابه
Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four
Let Kq(n, w, t, d) be the minimum size of a code over Zq of length n, constant weight w, such that every word with weight t is within Hamming distance d of at least one codeword. In this article, we determine Kq(n, 4, 3, 1) for all n ≥ 4, q = 3, 4 or q = 2m + 1 with m ≥ 2, leaving the only case (q, n) = (3, 5) in doubt. Our construction method is mainly based on the auxiliary designs, H-frames,...
متن کاملA Construction for Infinite Families of Steiner 3-Designs
Let q be a prime power and a be a positive integer such that a 2. Assume that there is a Steiner 3-(a+1, q+1, 1) design. For every v satisfying certain arithmetic conditions we can construct a Steiner 3-(va+1, q+1, 1) design for every d sufficiently large. In the case of block size 6, when q=5, this theorem yields new infinite families of Steiner 3-designs: if v is a given positive integer sati...
متن کاملNew infinite families of 3-designs from preparata codes over Z4
We consider t-designs constructed from codewords in the Preparata code ~ ove r 2~4. A new approach is given to prove that the support (size 5) of minimum Lee weight codewords form a simple 3-design for any odd integer m >t 3. We also show that the support of codewords with support size 6 form four new families of simple 3-designs, with parameters (2",6,2" 8 ) , (2",6,5 (2 m-I 4)), (2m,6,20 • (2...
متن کاملInfinite families of 3-designs from a type of five-weight code
It has been known for a long time that t-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a t-design. While a lot of progress in the direction of constructing codes from t-designs has been made, only a small amount of work on the construction of t-designs from codes has been done. The objective of this paper is to c...
متن کاملOdd and even group divisible designs with two groups and block size four
We show the necessary conditions are su6cient for the existence of GDD(n; 2; 4; 1, 2) with two groups and block size four in which every block intersects each group exactly twice (even GDD’s) or in which every block intersects each group in one or three points (odd GDD’s). We give a construction for near 3-resolvable triple systems TS(n; 3; 6) for every n¿ 4, and these are used to provide const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007